DistributedAverageConsensuswithTime - Varying MetropolisWeights ?
نویسندگان
چکیده
Given a network of processes where each node has an initial scalar value, we consider the problem of computing their average asymptotically using a distributed, linear iterative algorithm. At each iteration, each node replaces its own value with a weighted average of its previous value and the values of its neighbors. We introduce the Metropolis weights, a simple choice for the averaging weights used in each step. We show that with these weights, the values at every node converge to the average, provided the infinitely occurring communication graphs are jointly connected.
منابع مشابه
Modeling and Forecasting Iranian Inflation with Time Varying BVAR Models
This paper investigates the forecasting performance of different time-varying BVAR models for Iranian inflation. Forecast accuracy of a BVAR model with Litterman’s prior compared with a time-varying BVAR model (a version introduced by Doan et al., 1984); and a modified time-varying BVAR model, where the autoregressive coefficients are held constant and only the deterministic components are allo...
متن کاملOn the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)
This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.
متن کاملNumerical Solution of Optimal Control of Time-varying Singular Systems via Operational Matrices
In this paper, a numerical method for solving the constrained optimal control of time-varying singular systems with quadratic performance index is presented. Presented method is based on Bernste in polynomials. Operational matrices of integration, differentiation and product are introduced and utilized to reduce the optimal control of time-varying singular problems to the solution of algebraic ...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملDesign and Implementation of a Kalman Filter-Based Time-Varying Harmonics Analyzer
Nowadays with increasing use of numerous nonlinear loads, voltage and current harmonics in power systems are one of the most important problems power engineers encounter. Many of these nonlinear loads, because of their dynamic natures, inject time-varying harmonics into power system. Common techniques applied for harmonics measurement and assessment such as FFT have significant errors in presen...
متن کامل